Parameterized Analysis of Online Steiner Tree Problems
نویسنده
چکیده
Steiner tree problems occupy a central place in both areas of approximation and on-line algorithms. Many variants have been studied from the point of view of competitive analysis, and for several of these variants tight bounds are known. However, in several cases, worst-case analysis is overly pessimistic, and fails to explain the relative performance of algorithms. We show how parameterized analysis can help resolve this problem. As case studies, we consider the Steiner tree problem in directed graphs and the priority Steiner tree problem.
منابع مشابه
Parameterized Complexity of Arc-Weighted Directed Steiner Problems
We start a systematic parameterized computational complexity study of three NP-hard network design problems on arc-weighted directed graphs: directed Steiner tree, strongly connected Steiner subgraph, and directed Steiner network. We investigate their parameterized complexities with respect to the three parameterizations: “number of terminals,” “an upper bound on the size of the connecting netw...
متن کاملSubexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
The well-known bidimensionality theory provides a method for designing fast, subexponentialtime parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus graphs, or, more generally, graphs with a fixed excluded minor. However, in order to apply the bidimensionality framework the considered problem needs to fulfill a special densi...
متن کاملNear-Optimal Online Algorithms for Prize-Collecting Steiner Problems
In this paper, we give the first online algorithms with a polylogarithmic competitive ratio for the node-weighted prize-collecting Steiner tree and Steiner forest problems. The competitive ratios are optimal up to logarithmic factors. In fact, we give a generic technique for reducing online prize-collecting Steiner problems to the fractional version of their non-prize-collecting counterparts lo...
متن کاملParameterized Algorithms for Stochastic Steiner Tree Problems
Since 1971, numerous parameterized algorithms for the Steiner tree problem have been published, first of which was introduced by Dreyfus and Wagner. However, up to today there is not a single parameterized algorithm for the two-stage stochastic Steiner tree problem. This problem is still practically important and deserves more attention. This document first presents an algorithm that has a wors...
متن کاملA Note on Online Steiner Tree Problems
We introduce and study a new Steiner tree problem variation called the bursty Steiner tree problem where new nodes arrive into bursts. This is an online problem which becomes the well-known online Steiner tree problem if the number of nodes in each burst is exactly one and becomes the classical Steiner tree problem if all the nodes that need to be connected appear in a single burst. In undirect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009